Method and System for High Rate Uncorrelated Shared Secret Bit Extraction From Wireless Link Characteristics

ABSTRACT

A new methodology to exchange a random secret key between two parties. The diverse physical characteristics of the wireless medium and device mobility are exploited for secure key exchange. Unique physical characteristics of wireless channels between the two devices are measured at different random locations. A function of these unique characteristics determines the shared secret key between the two devices.

CROSS REFERENCE TO RELATED APPLICATIONS

The present application claims priority to and the benefit of U.S. Provisional Application No. 61/096,267, entitled “Method and System for High Rate Uncorrelated Shared Secret Bit Extraction from Wireless Link Characteristics,” filed on Sep. 11, 2008, which is herein incorporated by reference in its entirety for all purposes. The present application is related to U.S. Provisional Application No. 61/096,265, entitled “Method and System for Secret Key Exchange Using Wireless Characteristics and Random Device Movement,” filed on Sep. 11, 2008, which is herein incorporated by reference in its entirety for all purposes.

BACKGROUND OF THE INVENTION

1. Field of Invention

The present invention relates to the field of wireless networks. Specifically, the present invention relates to secret key exchange using temporal link signatures.

2. The Relevant Technology

Secret key establishment between two entities is a fundamental requirement for private communication between these entities. Currently, the most common method for establishing a secret key is by using public key cryptography. However, public key cryptography consumes significant amount of computing resources and power which might not be available in certain scenarios (e.g., sensor networks).

One of the important concerns with public key cryptography is that its security depends on factorization of large numbers. Researchers have argued that powerful future computers, for example quantum computers, when available, will be able to factorize large numbers quickly. In addition, measurements over time can be correlated. This may result in a correlated bit stream used for secret key generation that is less secure against attack. Also, the generation of secret keys historically require a long time because of low bit rates.

In addition, a public key infrastructure (PKI) requires the cumbersome use of a third party authentication service to verify the validity of a public or private key. Specifically, the PKI requires the use of a digital certification for document and identity authentication purposes. In general, such digital certificates are used to certify the identity of an entity in the digital world. A certificate authority (CA) is a trusted entity that issues, renews, and revokes certificates. Reference back to the CA is necessary to ensure that the public/private key combination is still valid.

What is necessary are techniques that do not use public key cryptography for next generation networks.

SUMMARY OF THE INVENTION

Accordingly, what is needed is secret key generation that does not require a public key. What is described is a new methodology to exchange a random secret key between two parties. The diverse physical characteristics of the wireless medium and device mobility are exploited for secure key exchange. Unique physical characteristics of wireless channels between the two devices are measured at different random locations. A function of these unique characteristics determines the shared secret key between the two devices.

Specifically, the time variation of the received signal strength (RSS) is measured and used as a characteristic of the radio channel between two devices. This information also provides the source of secret information shared between a transmitter and receiver. In addition, information reconciliation and privacy amplification techniques are performed for improving performance of the secret key generation and to achieve a faster rate of key generation.

In one embodiment, a method for generating a shared secret is described. Transmissions are exchanged between a first device and a second device over at least one channel. At a first device, a first signal is received from the second device, while exchanging the transmissions. A first impulse response is determined from the first signal that is received. A vector is generated based on the first impulse response. The vector is comprised of a plurality of elements. The plurality of elements of the vector is decorrelated to obtain a decorrelated vector. The decorrelated vector is normalized. Thereafter the decorrelated vector is quantized using Gray code sequences to generate a first digital secret.

In one embodiment, quantization is performed in the following manner. The decorrelated vector is grouped into a plurality of bins. For each of the plurality of bins, a Gray code sequence is assigned. Each of the Gray code sequence is comprised of a first part and a second part. The second part is comprised of a first bit sequence and a second bit sequence. For each element of the decorrelated vector, one of the first bit sequence and the second bit sequence is selected based on the first part. The digital secret is generated by combining selections of the first bit sequence and the second bit sequence for the plurality of elements.

BRIEF DESCRIPTION OF THE DRAWINGS

Exemplary embodiments are illustrated in referenced figures of the drawings which illustrate what is regarded as the preferred embodiments presently contemplated. It is intended that the embodiments and figures disclosed herein are to be considered illustrative rather than limiting.

FIG. 1 is an illustration of two wireless devices in communication for purposes of generating a shared digital secret, in accordance with one embodiment of the present invention.

FIG. 2 is a block diagram illustrating two wireless devices with components used for purposes of generating a shared digital secret, in accordance with one embodiment of the present invention.

FIG. 3 is an illustration of non-reciprocal measurements between two wireless devices, in accordance with one embodiment of the present invention.

FIG. 4 is an illustration of the process used for bit extraction, in accordance with one embodiment of the present invention.

FIG. 5A is a flow chart of a method for digital secret generation, in accordance with one embodiment of the present invention.

FIG. 5B is a block diagram of a system capable of implementing a method for digital secret generation, in accordance with one embodiment of the present invention.

FIG. 6 is an information flow diagram illustrating the generation of a digital secret using a Karhunen-Loève transformation and multi-bit adaptive quantization process, in accordance with one embodiment of the present invention.

FIG. 7 is a diagram showing areas of bit disagreement, in accordance with one embodiment of the present invention.

FIG. 8 provides the analytical approximation for the probability of bit disagreement from Eqn. 35, as a function of the number of bits per codeword, m, and correlation coefficient, ρ, in accordance with one embodiment of the present invention.

FIG. 9 is a diagram showing censored bits, in accordance with one embodiment of the present invention.

FIG. 10 is a graph describing a bit censuring scheme, in accordance with one embodiment of the present invention.

FIG. 11 is a graph describing the analytical probability of bit disagreement, in accordance with one embodiment of the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

Reference will now be made in detail to the preferred embodiments of the present invention, a method and system for generating a digital secret shared between two wireless devices. While the invention will be described in conjunction with the preferred embodiments, it will be understood that they are not intended to limit the invention to these embodiments. On the contrary, the invention is intended to cover alternatives, modifications and equivalents which may be included within the spirit and scope of the invention as defined by the appended claims.

Accordingly, embodiments of the present invention provide for a shared digital secret that is based on a physical layer characteristic of the radio channel between a transmitter and a receiver, that comprises a temporal link signature. The temporal link signature is the sum of the effects of the multiple paths from the transmitter to the receiver, each with its own time delay, phase, and complex amplitude. Such a signature changes when the transmitter or receiver changes position because the multiple paths in the link change with the positions of the endpoints of the radio link. Based on the temporal link signature, a secret key is generated by extraction secret key bits from the noisy radio channel measurements at tow nodes such that the two secret keys reliably agree. In particular, a process for high rate uncorrelated bit extraction (HRUBE) is described that provides a framework for transforming data vectors into uncorrelated components and encoding them using a multi-bit adaptive quantization scheme which allows for multiple bits per component. As such, embodiments of the present invention are capable of generating a digital secret based on the temporal link signature.

Overview

The present invention provides a unique solution to the problem of sharing secret keys between wireless devices by measuring and encoding radio channel characteristics without ever revealing the secret key to an eavesdropper at a third location. For instance, the inherent randomness in the wireless channel between two wireless devices (e.g., device A for user Alice and device B for user Bob) as a source for extracting bits of the secret key between these devices.

FIG. 1 is an illustration of two wireless devices within range of each other. The present invention provides for the generation of a sufficiently long secret. The length of the secret is dependent on the prevention of brute force attacks. Two devices A and B are shown in FIG. 1. Devices A and B are mobile and can be at different locations at different times. For instance, both device A and device B are each shown in three different locations. Let Xi be some physical characteristic of the link between A and B, at a time when A and B are at some specific location. Let Xi be measured accurately only by devices A and B and no other device that is not at the location of A or B. The present invention provides a suitable physical characteristic Xi and a function ƒ such that the shared secret between A and B is ƒ(X₁, X₂, X₃, . . . X_(n)). It is not computationally feasible for another device that can overhear the communication between A and B to discover this secret.

Central to the secret bit extraction are three properties of transmission and reception of radio signals, in embodiments of the present invention. Essentially, the radio channel is a time and space-varying filter, such that at any point in time has the identical filter response for signals sent from Alice to Bob as for signals sent from Bob to Alice.

The first property describes the reciprocity of the wireless radio channel. Specifically, the multipath properties of the radio channel (gains, phase shifts, and delays) at any point in time are identical on both directions of a link. The second property describes the temporal variations in the radio channel. Specifically, over time, the multipath channel changes due to movement of either end of the link, and any motion of people and objects in the environment near the link. In one embodiment, to introduce added security, a device may be moved or shaken (e.g., by a user) in order to generate more temporal variation. The third property describes spatial variations. That is, the properties of the radio channel are unique to the locations of the two endpoints of the link. An eavesdropper at a third location more than a few wavelengths from either endpoint will measure a different, uncorrelated radio channel.

More specifically, the temporal variations in the received signal strength (RSS) measurements at Alice and Bob are used to extract secret bits and derive a shared key. The time-variation of the RSS is measured and used as the statistic of the radio channel and the source of secret information shared between a transmitter and a receiver. The variation over time of the RSS is caused by motion and multipath fading.

In addition, the mean RSS value, a somewhat predictable function of path length, is filtered out of the measured RSS signal and does not appear in the secret bits. These RSS temporal variations, as measured by Alice and Bob, cannot be measured by an adversary eavesdropper (say Eve) from another location unless Eve is physically very close to Alice or Bob.

FIG. 2 is a block diagram of the devices A and B of FIG. 1, in accordance with one embodiment of the present invention. In particular, FIG. 2 shows the components of devices A and B that are used to produce the final secret key. For instance, each of the devices include a bit extraction module, an information reconciliation module, and a privacy amplification module. At both ends, substantially identical secret keys are generated.

A bit extraction module is capable of filtering and quantizing the received signal at both ends of the channel (e.g., devices A and B).

The information reconciliation module addresses the situation where the radio channel between devices A and B includes non-reciprocal elements. That is, due to non-ideal conditions, including limited capabilities of the wireless hardware, Alice and Bob are unable to obtain identical measurements of the channel. This asymmetry in measurements brings up the challenge of how to make Alice and Bob agree upon the same bits without giving out too much information on the channel that can be used by Eve to recreate secret bits between Alice and Bob, as will be discussed below. To solve the asymmetry problem while minimizing the information leakage, a quantum cryptography technique involving information reconciliation is adapted to the wireless domain.

The privacy amplification module addresses the concern that the bits Alice and Bob extract from the measurements of the radio channel are not totally random due to the short-term correlation between bits. That is, the radio channel changes slowly over time. This happens when the motion of the wireless devices and that of the objects in the environment is slow. As such, if the channel measurements are used directly to create the secret key, the measurement bits are likely to be repeated. Stated in another way, the entropy of the extracted bit stream is less than 1. If not handled adequately, the correlation between bits can enable Eve to guess certain bits of the derived key with high probability if she is able to guess one bit correctly. To solve this problem, a quantum cryptographic method called privacy amplification is employed to reduce the amount of information the attacker can have about the derived key. This is achieved by letting both Alice and Bob use universal hash functions, chosen at random from a publicly known set of such functions, to transform the reconciled bit stream into a nearly perfect random bit stream. This nearly perfect random bit stream is then used as the secret key between Alice and Bob. As an additional advantage, privacy amplification also minimizes the impact of the information leaked during information reconciliation.

The present invention for generating secret keys in a wireless environment is universally applicable to a wide variety of wireless networks and capable of simultaneously achieving a high secret bit rate and nearly perfect random secret bit stream. In one embodiment, to keep the secret bit generation rate high, a motion of the wireless device is introduced. In addition, novel applications of information theoretic methods developed for quantum cryptography are applied to secret key generation from wireless channel measurements.

Adversary Model

An adversary Eve is considered that can overhear all communication between the Alice and Bob. The adversary can also be in some locations where the transmitter or receiver associated with Alice and Bob have been in the past, or will be in the future. In addition, Eve can also measure both the channels between herself and Alice and Bob at the same time when Alice and Bob measure the channel between them for key extraction. An assumption can be made that Eve knows the key extraction algorithm and the values of the parameters used in the algorithm.

Physical Characteristics Between Nodes and Temporal Link Signature

A physical layer characteristic of the radio channel between a transmitter and a receiver can be identified as a temporal link signature. The temporal link signature is the sum of the effects of the multiple paths over which radio waves propagate on a link from the transmitter to the receiver, each with its own time delay and complex amplitude. The power of the temporal link signature comes from the variability in the multiple paths over which radio waves propagate on a link. A single radio link is composed of many paths from the transmitter to the receiver. These multiple paths (multipath) are caused by the reflections, diffractions, and scattering of the radio waves interacting with the physical environment. Each path has a different length, so a wave propagating along that path takes a different amount of time to arrive at the receiver. Each path has attenuation caused by path losses and interactions with objects in the environment, so each wave undergoes, a different attenuation and phase shift. At the receiver, many copies of the transmitted signal arrive, but each copy arriving at a different time delay, and with a different amplitude and phase. The sum of these time delayed, scaled, and phase shifted transmitted signals is the received signal. The temporal link signature of a radio channel is essentially its channel impulse response.

For the channel between transmitter A and receiver B, the channel impulse response (CIR), denoted h_(A,B)(t), as shown in Eqn. 1.

$\begin{matrix} {{{h_{A,B}(\tau)} = {\sum\limits_{l = 1}^{L}{\alpha_{l}^{j\; \varphi_{l}}{\delta \left( {\tau - \tau_{l}} \right)}}}},} & (1) \end{matrix}$

In Eqn. 1, α_(l) and φ_(l) are the amplitude and phase of the lth multipath component, τ_(l) is its time delay, L is the total number of multipath, and δ(τ) is the Dirac delta function. Essentially, the filter impulse response is the superposition of many impulses, each one representing a single path in the multiple paths of a link. Each impulse is delayed by the path delay, and multiplied by the amplitude and phase of that path. Now, h_(A, B)(τ) can be estimated from the samples of the signal received at the receiver B. This sample estimate of h_(A, B)(τ) represents the temporal link signature. In addition, the estimate can be normalized with respect to the signal amplitude to obtain an amplitude-normalized link signature. As such, the received power is not necessarily a function of the channel, since because the transmit power can be easily changed.

Non-Reciprocal Measurements

FIG. 3 is an illustration of the hardware components included within the two wireless devices of FIG. 1, in accordance with one embodiment of the present invention. Specifically, the signal received at both ends of the channel between devices A and B include non-reciprocal elements. That is, compared to the signal in path B to A, the signal in path A to B passes through the same reciprocal radio channel, but a different DAC, ADC, low noise amplifier, and power amplifier. The additive noise in each direction is independent.

Reciprocity is a basic property of electromagnetic channels. However, any channel measurements also contain some non-reciprocal elements. The non-reciprocal elements of channel measurements are caused both by additive noise and interference. In addition, the radio channel between devices A and B is measured with real-world hardware components, which have limited capabilities and manufacturing variations.

For instance, ideally, both nodes would measure the channel at precisely the same time, but typical commercial transceivers are half-duplex, i.e., each node can operate their transmitter or receiver, but not both simultaneously. Thus, nodes must measure the radio channel in one direction at a time. However, as long as the time between two directional channel measurements is much smaller than the rate of change of the channel, the half-duplex limitation is not severe.

The other element of non-reciprocity involves the hardware used in each direction of the link. Shown in FIG. 3 is the path of the signal through the hardware of each of the nodes during measurement of the channel in both directions. In direction A-B, the signal path is through the digital-analog converter (DAC), power amplifier (PA) on device A, and the low noise amplifier (LNA) and analog-digital converter (ADC) on device B. However, in direction B-A, these components are the ones on the opposite device. Even if the two transceivers were manufactured at the same fabrication plant, there will be manufacturing variations in the responses of these components. For example, the frequency response and gain of the PA will vary from device to device. These variations introduce non-linearities into the radio channel measurements, even though the radio channel itself is reciprocal.

Also, although the radio channel is reciprocal, measurements of the radio channel are not reciprocal. First, additive noise contributes to each measurement as it does in any received signal. Next, as described above, the transceiver hardware used by the two nodes are not identical and affect the signal in each direction in a different way. Finally, standard commercial receivers are not capable of transmitting and receiving simultaneously, so measurement from device A to device B must be half-duplex. As such, measurements of a temporal channel characteristics is done at a slightly different times, when taking measurements from devices A to B than the measurement taken from devices B to A. These non-reciprocal elements collectively comprise noise because they are the ultimate cause of bit disagreements between the secret keys generated at devices A and B.

Bit Extraction

FIG. 4 is an illustration of the process used for bit extraction, in accordance with one embodiment of the present invention. The radio channel between devices A and B is both a reciprocal and a time-varying filter. Like any filter, the radio channel filter can be described by various statistics. As such, the measured channel gain is a statistic of the radio channel.

To facilitate the key extraction process, the devices associated with Alice and Bob send probe packets to each other. When a device receives a packet, it records its measured received signal strength (RSS). As multiple packets are exchanged between Alice and Bob, each device builds a time series of the measured RSS. Let r_(a,i) be the RSS measured at node a at time i. The bit extraction methodology filters and quantizes this RSS time series, as shown in FIG. 4.

Specifically, the filter has two requirements: (i) it should reduce measurement noise; and (ii) it should remove the mean gain, which is often a strong function of the device characteristics. A low pass filter (LPF) is used to remove noise and subtract the windowed mean to remove the long-term average gain. In addition, each node for devices A and B quantizes the time series, denoted {x_(a,i)}, to generate its initial bit secret key.

The filter characteristics are described in detail below. A vector x_(a) is formed, such that x_(a)=[x_(a,l), . . . , x_(a,N)]^(T). In this vector, for each i, x_(a,i) is classified as being above, below or within a threshold region, [−γ, γ]. Those above γ are encoded as 1s and those below γ are encoded as 0s, in one embodiment. Of course the encoding could use the opposite values, in another embodiment. The indices of the vector with values that fall within the threshold region should not be encoded. Specifically, node a forms the set T_(a)={i: −γ≦x_(a,i)≦γ} and transmits the list of the elements in T_(a) to node b. Node b similarly forms T_(a) and transmits it to node a. The union of both sets, T=T_(a)∪T_(b) are the indices not used in the generated secret. Let T={1, . . . , N}\T be the indices that will be used in the secret, and let t_(j)ε{1, . . . , | T|} be the jth element of T. Then, the secret bit vector of node a is given by A=[A₁, . . . , A_(n)]^(T), where n=| T|, and

$\begin{matrix} {A_{j} = \left\{ \begin{matrix} {1,} & {x_{a,t_{j}} > \gamma} \\ {0,} & {x_{a,t_{j}} < {- \gamma}} \end{matrix} \right.} & (2) \end{matrix}$

Similarly, vector B is formed at node b using the data {x_(b,t) _(j) } for t_(j)ε T.

Information Reconciliation

Once both devices A and B associated with Alice and Bob extract the bit stream from their channel measurements using the above methodology, to agree upon the same key, they must correct the bits where the two bit streams differ. The differences in the two bit streams arise due to the non-reciprocal elements described earlier. The asymmetry in the bit streams brings up the challenge of how to make the devices A and B agree upon the same bits without giving out too much information on the channel that can be used by Eve to recreate secret bits between devices A and B.

Towards the development of an efficient methodology for aligning the two bit streams at devices A and B, an estimate is needed to determining the information theoretic limit for the minimum amount of information publicly transmitted in order to correct all the errors. Let {p(x)}_(xεS) _(X) be a probability distribution of a discrete random variable X over a finite set S_(X). The entropy of X, denoted by H(X), is defined as follows in Eqn. 3.

$\begin{matrix} {{H(X)} = {- {\sum\limits_{x \in S_{x}}{{p(x)}{\log \left( {p(x)} \right)}}}}} & (3) \end{matrix}$

All logarithms are base 2 unless stated otherwise. H(X) is the theoretical limit on the minimum number of bits needed to specify the value of the random variable X. It is assumed that devices A and B both have two bit streams A and B of length n. Then, define P_(i) to be the ‘disagreement’ function, as provided in Eqn 4.

$\begin{matrix} {P_{i} = \left\{ \begin{matrix} {1,} & {A_{i} = B_{i}} \\ {0,} & {A_{i} \neq B_{i}} \end{matrix} \right.} & (4) \end{matrix}$

The value of P_(i) indicates an disagreement on bit i between devices A and B. Define p=P[P_(i)=0] to be the probability of this bit disagreement. The per bit entropy H(P) of the information which device A associated with Alice needs to send to device B for bit correction is provided in Eqn. 5.

H(P)=−p log(p)−(1−p)log(1−p)

Since devices A and B need to fix bit streams of length n, the minimum amount of information which is needed to be revealed during information reconciliation is provided in Eqn. 6.

nH(P)=−np log(p)−n(1−p)log(1−p)  (6)

Note that the above analysis assumes that samples of P_(i) are independent. In reality, the random process {P_(i)} will have correlation between samples, as will be explored in the description regarding privacy amplification.

The problem of correcting Alice's and Bob's bit streams whose value differ in some bits is very similar to the error correction coding problem in information theory. Therefore, use of different error correcting codes can be used to solve this problem. Let C: {0,1}^(k)→{0,1}^(n) denote a binary [n, k, 2t+1] linear error correcting code and D: {0,1}^(n)→{0,1}^(k) denote the decoding function of this code. Here, k is the size of the original block, n is the size of the encoded block, and t is the integer number of bit errors that the code can correct.

It is assumed that the Hamming distance between A and B is less than t. In this procedure, Alice publicly releases the syndrome of her data A, Syn(A), to Bob. Bob uses Syn(A) and his own string B to calculate A, in Eqn. 7.

A=B⊕C(D(B⊕Syn(A)))  (7)

The calculation in Eqn. 7 can be done in polynomial time if the error correcting code supports decoding and encoding in polynomial time. The syndrome of a [n, k, 2t+1] error correcting code is n−k bits long. So, this process gives away at most n−k bits of information about the secret string.

Typically, error correction codes need to calculate the redundant information (that is used in correcting errors) all at once. However, instead of using error correction codes, the present invention utilizes a protocol that works in an interactive fashion, where certain amount of information is revealed and used by both the parties. After this if it is found that there is a high probability of both bit streams still being different, some more information can be revealed. This step can be iterated until the probability of two bit streams being different falls below a certain threshold. For instance, one device (device A or B) permutes the bit stream randomly, divides it into small blocks and sends permutation and parity information of each block to the other device. The other device permutes its bit stream in the same way, divides it into small blocks, calculates and checks whether the parity of the blocks are same or not. For each block whose parity does not match, device B performs a binary search to find which bit in that block actually differs and thus reveals more parity information in the process. These steps are iterated multiple times until the probability of success becomes higher than the desired threshold. As a result, the present invention reveals less information than the error correcting code based approach.

Privacy Amplification

There are situations when the bit streams obtained from the channel measurements have redundant bits. First, when the channel is sampled at a rate that is higher than the rate at which the channel changes with time, the channel measurements can be time-correlated. Second, in the information reconciliation stage the redundant information is given out (either in the form of a syndrome of a linear code or the parity bits of different blocks of data) to make bit streams at device A and B exactly the same. An adversary Eve may be able to use this correlated/redundant information to guess some portions of the extracted key unless portions of the bit stream are removed in a way that makes the revealed information useless to the adversary.

Specifically, strong randomness extractors are used to extract purely random bits from the reconciled bits. Strong extractors can extract at most (n₀−2 log(1/ε)+O(1)) nearly random bits, where n₀ is the entropy in bits of the bit stream input to the algorithm, and ε is the error limit. Constructions of strong extractors are often complex as they tend to achieve high efficiency by minimizing the length of initial seed. However, the length of the seed is of less importance than maximizing the amount of randomness that can be extracted.

In one embodiment, hash functions drawn at random from a 2-universal family of hash functions can be used to achieve extraction of optimal n₀−2 log(1/ε) bits. For instance, the leftover hash-lemma function can be used. Let K be a set of keys, V be a set of values and

be a family of hash functions mapping K to V. The functions in set

can be indexed by S in a set “S”. Typically, S is referred to as the random seed and set “S” is the set of possible seeds. The set

is called a 2-universal family of hash functions if for all pairs of distinct keys x and y in K the condition in Eqn. 8 holds.

P _(SεS) [h _(S)(x)=h _(S)(y)]≦1/|V|  (8)

In Eqn. 8, P denotes the probability operator, h_(s)( ) is the function in

indexed by S, and |V| denotes the size of V. The leftover hash-lemma states that if X is a random variable over {0,1\}^(n), m>0 and h: S×{0, 1}^(n)→{0, 1}^(m) is a 2-universal hash function, and if

m≦H _(∞)(X)−2 log(1/ε),  (9)

where H_(∞)(X) denotes the Renyi entropy of X, then for S taken to be a uniform random variable over set “S” and independent of X,

δ((h _(S)(X),S),(U,S))≦ε,  (10)

where U is uniform over {0, 1}^(m) and independent of S, ε is the error limit, and δ(X, Y) is the statistical distance between X and Y defined in Eqn. 11.

$\begin{matrix} {{\delta \left( {X,Y} \right)} = {\frac{1}{2}{\sum\limits_{\upsilon}{{{\Pr \left\lbrack {X = \upsilon} \right\rbrack} - {\Pr \left\lbrack {Y = \upsilon} \right\rbrack}}}}}} & (11) \end{matrix}$

In other words any 2-universal family of hash function can be used to extract H_(∞)(X)−2 log(1/ε) random bits out of any random variable X.

For instance, a 2-universal hash family consisting of all the functions h_(a,b): {1 . . . M}→{0, 1}^(m) can be used of the form in Eqns. 12 and 13:

g _(a,b)(x)=(ax+b)mod p _(M)  (12)

h _(a,b)(x)=g _(a,b)(x)mod m  (13)

where for every aε{1, . . . p_(M)−1} and bε{0, . . . , p_(M)−1}, p_(M) is a prime number and p_(M)>M.

Secret Bit Rate Estimation

Let us assume that the bit streams produced by measuring the channel have a minimum entropy of n₀ bits. Let p denote the probability of a bit having different values in the bit stream for device A and the bit stream for device B. In addition, let T denote the time (in seconds) taken by device A and B to extract these bit streams by taking channel measurements. As mentioned earlier, information theoretic limit on the amount of information, which needs to be communicated between device A and B to make their bit stream identical, is n₀(p log(p)+(1−p)log(1−p)). Let ε denote the error limit on the statistical difference between the final derived key using the privacy amplification stage and the uniform distribution. As such, in the privacy amplification stage, n₀(p log(p)+(1−p)log(1−p))+2 log(1/ε) bits need to be removed. In other words, after the privacy amplification stage, a secret key of length n₀−n₀(p log(p)+(1−p)log(1−p))−2 log(1/ε) is generated. Therefore, the key generation rate is expressed in Eqn 14.

$\begin{matrix} {r = \frac{n_{0\;} - {n_{0}\left( {{p\; {\log (p)}} + {\left( {1 - p} \right){\log \left( {1 - p} \right)}}} \right)} - {2{\log \left( {1/\varepsilon} \right)}}}{T}} & (14) \end{matrix}$

Device Mobility

At any moment in time, when a channel is sampled to determine a temporal link signature the size of the secret space may be limited to a certain bit length. For instance, the effective shared secret bit space may be between 10-50 bits in length. In one embodiment, to increase the length of a shared secret, multiple independent measurements are obtained of the temporal key signatures between device A and B. These multiple temporal key signatures are combined to produce a larger shared secret. For example, consider obtaining 20 measurements of independent temporal link signatures, such that device A or B from FIG. 1 move, relative to each other, in a random manner. The introduction of a random movement can be achieved mechanically, or by a user, in embodiments of the invention.

In one embodiment, the random movement occurs over a space exceeding one meter. That is, the random movement can be broken down into steps that are bigger than one meter. In other embodiments, the random movements can be broken down into steps that are less than one meter (e.g., 10 cms), such that the total space in which the random movement is generated occurs approximately within a one square meter space. With smaller random movements, the two bit streams at device A and B may not be as well correlated. This may require longer or additional steps to align the two bit streams at device A and B to create a sufficiently long digital secret.

For example, a shared secret may include twenty independent measurements in the order they were measured. As such, the size of the shared secret is increased by bits equivalent to twenty factorial (20!). An attacker will have to try 20! permutations to break the shared secret, in the worst case. The 20! permutations corresponds to about sixty-one (61) bits, which is in addition to the normal shared secret space. For a secret space of approximately twenty-five (25) bits, the random movement increases the size of the shared secret to approximately eighty-five (85) bits.

In addition, the size can be increased by introducing more independent measurements. For instance, forty (40) independent measurements at random locations will increase the shared secret space size by about one-hundred sixty (160) bits.

Multiple-Input-Multiple-Output Radio Channels

We propose to explore the use of multiple-input multiple-output (MIMO) radio channels to dramatically expand the quantity of link information that can be used as a shared secret. Generally, narrowband MIMO channels are represented as a complex-valued transfer matrix, H, such that the received signal vector y can be represented as a linear combination of the transmitted signal x, that is, y=H x. Each element of the vector x is the complex signal amplitude sent from one of the N transmit antennas, and each element of y is the complex signal amplitude received at one of the M antennas. The N×M elements of matrix H are random variables, with correlation depending on the spacing of the antennas. In addition, MIMO systems typically use measurements at multiple frequencies. In total, a large quantity of multipath channel information is measured using the H matrices. Interestingly, this can be done without any overheads because MIMO radios must estimate H. These MIMO measurements can be used to determine a shared secret.

In particular, each pair of transmitters is capable of generating a shared secret key between the two devices. As such, a combination of digital secrets can be combined to form a larger digital secret, or secret key that is shared between the two devices for purposes of secure communication. The multiple pairs of transmitters/receivers provide for the generation of the secret key over a shorter period of time. In one embodiment, the spacing between the transmitters/receivers at single device is separated by at least one-half wavelength of the transmitted signal (e.g., 6 cms.).

Shared Secret Generation

FIGS. 5A-B combined illustrate the generation of a shared secret between devices. Specifically, FIG. 5A is a flow chart 500A illustrating steps in a method for shared secret generation between two wireless devices, in accordance with one embodiment of the present invention. The process in flow chart 500 describes the shared secret key generation from channel measurements using a high rate uncorrelated bit extraction process. FIG. 5B is a block diagram of a system 500B that is capable of implementing the method of flow chart 500, in accordance with one embodiment of the present invention.

Turning now to FIG. 5A, at 510, transmissions are exchanged between a first device and a second device over at least one channel. For instance, transmissions are exchanged between device A and device B of FIG. 2. One or more channels may be defined between devices A and B since the transmissions occur over an extended period for data collection. As an example, the period for data collection may range from less than one second to more than thirty seconds.

The operations performed at 520 and 530 have been discussed at length in the description of bit extraction. In particular, at 520, a first signal is received at the first device from the second device during the exchange of transmissions and the performance of the random movement. For instance, the receiver 525 is capable of receiving the first signal. In generation of the digital secret, this process is performed at both devices. In this manner, the digital secret is generated at both ends of the channel, taking advantage of the reciprocal characteristics of the one or more channels between the two devices. The received signals need not be simultaneously transmitted and received at both devices, in one embodiment. In another embodiment, the received signals are transmitted and received at both devices simultaneously. The discussion following is directed at one of the two devices, but is equally applicable for the other device in the generation of the digital secret.

At 530, an impulse response is determined from the received signal over the one or more channels. For instance the impulse response generator 535 of system 500B is capable of determining an impulse response. The impulse response is the RSS data {r_(a,i)}, in one embodiment.

At 540, a vector is generated based on the first impulse response. The vector is comprised of a plurality of elements. For instance, vector generator 545 of system 500B is capable of generating a vector.

At 550, the plurality of elements of the vector is decorrelated to obtain a decorrelated vector. For instance, decorrelator 555 of system 500B is capable of decorrelating the vector. At 560, the decorrelated vector is normalized. In system 500B, the normalizer 565 performs the normalizing function.

Thereafter the decorrelated vector is quantized using Gray code sequences to generate a first digital secret. For instance, the secret key generator 575 is capable of performing quantization to generate the first digital secret. In particular, quantization is described in operations 570, 580, 590 and 595 of FIG. 5. Specifically, quantization is performed in the following manner. At 570, the decorrelated vector is grouped into a plurality of bins. For instance, for a given vector of values, there may be eight bins, four above the normal, and four below the normal.

At 580, for each of the plurality of bins, a corresponding code sequence is assigned. Each of the code sequences is comprised of a first part and a second part. The first part includes one or more bits, and is used in the selection of values from the second part.

The second part is comprised of a first Gray code sequence and a second Gray code sequence. The first Gray code sequences follow the rules for Gray code sequences for the bins taken together. In addition, the second Gray code sequences follow the rules for Gray code sequences for the bins taken together.

At 590, for each element of the decorrelated vector, one of the first bit sequence and the second bit sequence is selected based on the first part. More particularly, let the first device be the control device. The first part is determined for each element of the decorrelated vector at the first device. The first device sends the first part to the second device.

At 595, the second device receives the first part, and uses the first part, as determined from the first device, for correlating the selection of Gray code sequences between the two devices. More particularly, at the second device, one of the first Gray code sequence and the second Gray code sequence is selected based on the first part that is determined at the first device. In this manner, values that are on the border between bins are correlated between the two devices. This is done for each element of the vector. Thereafter, the digital secret is generated by combining selections of the first bit sequence and the second bit sequence for the plurality of elements.

Following is a discussion that provides a statistical framework for bit extraction which extracts a high bit rate with given reliability and ensures an uncorrelated bit stream. The present invention provides bit extraction using novel techniques.

FIG. 6 is a information flow diagram illustrating the process for generating a secret key at a high bit rate, illustrating the novel techniques. First, a de-correlation transformation process produces a measurement vector with uncorrelated components via a Karhunen-Loève transformation of the original channel measurement vector. Second, a multi-bit adaptive quantization (MAQ) process converts real-valued channel measurements into bits adaptively based on the measured value, using communication so that both nodes agree on the quantization scheme. The present invention utilizes these novel techniques in order to transform correlated, real-valued radio channel signal measurements at two nodes into uncorrelated binary data which has a high likelihood to be identical at both nodes. Throughout this application, the combination of the two methods is referred to as “high rate uncorrelated bit extraction” (HRUBE). As such, the present invention provides a theoretical framework to design systems with low probability of bit disagreement and to predict the probability of bit disagreement.

De-Correlation Transformation

The discrete Karhunen-Loève transform (KLT) is used in order to convert the measured channel vector into uncorrelated components, in one embodiment. Other transforms are contemplated in other embodiments. The KLT is applied for the purpose of generating uncorrelated elements for the digital secret, which for purposes of security and robustness to attacks should not contain significant correlation between elements.

The discrete KLT provides an orthogonal basis which de-correlates the input vector, assuming a known model for the covariance structure of the original vector. For particular classes of signals, statistical models can be found (e.g., for electrocardiogram signals, voice signals, internet traffic measurements, and fingerprints). As such, a correlation model using large sets of measurements can be developed and used to calculate the appropriate KLT.

In the discrete KLT, a linear transformation of an input vector is taken, which results in a vector with uncorrelated elements. Assume that the (length N) input vector at some node c, x_(b) has mean μ_(x) and covariance matrix R_(x). A linear transform of the data can be written in Eqn. 15.

y _(c) =A ^(T)(x _(c)−μ_(x))  (15)

In Eqn. 15, A is an N×N matrix. The mean of y_(c) is zero, and the covariance matrix of y_(c), R_(y), is given in Eqn. 16.

R _(y) =E[y _(c) y _(c) ^(T) ]=A ^(T) R _(x) A  (16)

As a covariance matrix, R_(x) is symmetric and positive semi-definite, and thus has non-negative eigenvalues. Since it is desired to have R_(y) be a diagonal matrix, the singular value decomposition of R_(x) is computed in Eqn 17.

R_(x)=USU^(T)  (17)

In Eqn 17, U is the matrix of eigenvectors, and S=diag{σ₁ ², . . . , σ_(N) ²}, is a diagonal matrix of the corresponding eigenvalues. It is assumed that the eigenvectors have been sorted in order of decreasing eigenvalue, so that σ₁ ²≧σ₂ ²≧ . . . ≧σ_(N) ². Note that the matrix U is an orthonormal basis, so that U^(T)U=I_(N) where I_(N) is the N×N identity matrix.

The discrete KLT assigns A=U, so that when simplifying Eqn. 16, the result is Eqn. 18, where the output vector y_(c) in fact has a diagonal covariance matrix, indicating uncorrelated elements.

Bi-Directional Measurement Covariance

Although the elements of y_(c) are decorrelated by the KLT, there is still covariance between the elements measured at the two nodes at the endpoints of the link. In fact, a high positive correlation on the two different directions of the link is what enables secret sharing. Let a and b be the two endpoints of a link. The covariance matrix of the original measurements is denoted in Eqn. 18.

R_(x) _(a) _(,x) _(b)

E[x_(a)x_(b) ^(T)]=E[x_(b)x_(a) ^(T)]  (18)

Note that E[x_(a)x_(b) ^(T)] must be symmetric since the order of a and b are arbitrary and may be exchanged. After the KLT, the vectors y_(a) and y_(b) have covariance matrix denoted in Eqn. 19.

R_(y) _(a) _(,y) _(b)

E[y_(a)y_(b) ^(T)]=U^(T)R_(x) _(a) _(,x) _(b) U  (19)

In Eqn. 19, the ith diagonal element R_(y) _(a) _(,y) _(b) , denoted here as [R_(y) _(a) _(,y) _(b) ]_(i,i), is the covariance of y_(a)(i) and y_(b)(i). Since the variance of both bidirectional elements is the same and equal to σ_(i) ², the correlation coefficient of the ith component is denoted ρ(i). Eqn. 20 follows.

$\begin{matrix} {\rho_{i}^{2} = \frac{\left\lbrack R_{y_{a},y_{b}} \right\rbrack_{i,i}}{\sigma_{i}^{2}}} & (20) \end{matrix}$

The correlation coefficient ρ(i) is effectively a measure of the signal to noise ratio of the measurement of the bi-directional ith component of y. When the ‘noise’ contributing to both y_(a)(i) and y_(b)(i) is high, the value of [R_(y) _(a) _(,y) _(b) ]_(i,i) will be low compared to σ_(i) ², and ρ(i) will be closer to zero. When there is very little noise, ρ(i) will be close to 1. The value of ρ(i) is a critical component to determine both how many bits to which the ith component can be quantized, and the performance of the quantization method, in terms of the probability that the bits generated agree at the two nodes.

Multi-Bit Adaptive Quantization

The present invention quantizes the transformed vector y_(c) into a secret bit vector. In the process, it is described to obtain as long of a secret as possible, while keeping the probability that the secret key will not match at the nods on the opposite ends of the link as low as possible. To maintain the zero covariance between elements of the secret key, the bit extractor is limited to scalar quantization on each element of y_(c).

To address the tradeoff between secret bit length and error rate, a component i quantifies the tradeoff in a single component. The quantizer is a function Q_(i):

→{0, . . . , 2^(m) ^(i) }, where m_(i) is the number of bits to which the ith component is quantized.

The multi-bit adaptive quantization provides another method for quantizing the secret key. Another method was discussed previously in Eqn. 2. The multi-bit adaptive quantization (MAQ) scheme adaptively quantizes each measurement to an arbitrary number of bits without censoring indices. No fixed quantization scheme is able to achieve a low error rate because when y_(a)(i) is very near to a threshold, there is a high probability that y_(b)(i) crosses to the other side of that threshold. As a solution, the quantization thresholds at both a and b is based on the measurement at one of the nodes. For purposes of clarity and brevity, without loss of generality, node a is designated as the ‘leader’ node in the multi-bit adaptive quantization scheme, and that node b is the ‘follower’.

In the present MAQ scheme, y_(a)(i) to K

2^(m) ^(i) ⁺²=4×2^(m) ^(i) is quantized into equally-likely quantization levels. To achieve exactly equally-likely quantization levels, assuming a distribution for y_(a)(i) is required. In general, let F_(i)(y) be the cumulative distribution function (CDF) of y_(a)(i). That is, F_(i)(y)=P[y_(a)(i)≦y]. Thresholds for equally likely quantization bins are generated by using the inverse of the CDF in Eqn. 21 for k=1, . . . , K−1.

$\begin{matrix} {\eta_{k} = {F_{i}^{- 1}\left( \frac{k}{4 \times 2^{m_{i}}} \right)}} & (21) \end{matrix}$

In the following, for ease of notation, let η₀=−∞ and η_(K)=∞. The kth quantization bits is the interval (η_(k-1), η_(k)] for k=1, . . . , K, so k(i) is given in Eqn 22.

$\begin{matrix} {{k(i)} = {\max\limits_{k}\left\{ {{k\mspace{11mu} {s.t.\; {y_{a}(i)}}} > \eta_{k - 1}} \right\}}} & (22) \end{matrix}$

Next, a particular type of Gray code is used to adaptively assign a binary codeword to each quantization bin. For instance, this is accomplished by defining the following binary variables. First, define e(k), for k=1, . . . , K, where e(k) is the twos bits in the unsigned bit representation of integer k in Eqn 23.

$\begin{matrix} {{e(k)} = \left\{ \begin{matrix} {1,} & {{k\; {mod}\; 4} \geq 2} \\ {0,} & {o.w.} \end{matrix} \right.} & (23) \end{matrix}$

Then, create a Gray codeword with m_(i) bits. In other words, an ordered list of 2^(m) ^(i) possible m_(i)-bit code words is created. By definition, a Gray codeword list changes only one bit between neighboring codewords in the list.

Also, let

${f_{1}(k)} = {\left\lfloor \frac{k - 1}{4} \right\rfloor.}$

Define d₁(k)ε{0, 1} ^(i) to be equal to the ƒ₁(k)th Gray codeword. That is, it is the same Gray codeword list but with each element repeated four times.

In addition, let

${f_{0}(k)} = {\left\lfloor \frac{k + {1\; {mod}\; K}}{4} \right\rfloor.}$

Define d₀(k)ε{0, 1}^(m) ^(i) to be equal to the ƒ₀(k)th Gray code. That is, it is the same list as d₁(k), but circularly shifted by two.

Two examples are presented in Table 1 and Table 2, for the case of m_(i)=1 and m_(i)=2, respectively.

TABLE I Bin Codeword Interval k d₁ d₀ e of y(i) 1 0 0 0 (−∞, F_(i) ⁻¹(0.125)] 2 0 0 1 (F_(i) ⁻¹(0.125), F_(i) ⁻¹(0.25)] 3 0 1 1 (F_(i) ⁻¹(0.25), F_(i) ⁻¹(0.375)] 4 0 1 0 (F_(i) ⁻¹(0.375), F_(i) ⁻¹(0.5)] 5 1 1 0 (F_(i) ⁻¹(0.5), F_(i) ⁻¹(0.625)] 6 1 1 1 (F_(i) ⁻¹(0.625), F_(i) ⁻¹(0.75)] 7 1 0 1 (F_(i) ⁻¹(0.75), F_(i) ⁻¹(0.875)] 8 1 0 0 (F_(i) ⁻¹(0.875), +∞) EXAMPLE m_(i) = 1-BIT ADAPTIVE QUANTIZATION SCHEME.

TABLE II Bin Codeword Interval k d₁ d₀ e of y(i) 1 01 00 0 (−∞, F_(i) ⁻¹(0.0625)] 2 01 00 1 (F_(i) ⁻¹(0.0625), F_(i) ⁻¹(0.125)] 3 01 01 1 (F_(i) ⁻¹(0.125), F_(i) ⁻¹(0.1875)] 4 01 01 0 (F_(i) ⁻¹(0.1875), F_(i) ⁻¹(0.25)] 5 11 01 0 (F_(i) ⁻¹(0.25), F_(i) ⁻¹(0.3125)] 6 11 01 1 (F_(i) ⁻¹(0.3125), F_(i) ⁻¹(0.375)] 7 11 11 1 (F_(i) ⁻¹(0.375), F_(i) ⁻¹(0.4375)] 8 11 11 0 (F_(i) ⁻¹(0.4375), F_(i) ⁻¹(0.5)] 9 10 11 0 (F_(i) ⁻¹(0.5), F_(i) ⁻¹(0.5625)] 10 10 11 1 (F_(i) ⁻¹(0.5625), F_(i) ⁻¹(0.625)] 11 10 10 1 (F_(i) ⁻¹(0.625), F_(i) ⁻¹(0.6875)] 12 10 10 0 (F_(i) ⁻¹(0.6875), F_(i) ⁻¹(0.75)] 13 00 10 0 (F_(i) ⁻¹(0.75), F_(i) ⁻¹(0.8125)] 14 00 10 1 (F_(i) ⁻¹(0.8125), F_(i) ⁻¹(0.875)] 15 00 00 1 (F_(i) ⁻¹(0.875), F_(i) ⁻¹(0.9325) 16 00 00 0 (F_(i) ⁻¹(0.9325), +∞) EXAMPLE m_(i) = 2-BIT ADAPTIVE QUANTIZATION SCHEME.

Multi-bit adaptive quantization proceeds as follows. First, from the values of y_(a)(i), leader node a determines the quantization bin k(i) for all components i. Node a transmits the bit vector e=[e(k(1)), . . . , e(k(N))]^(T) to the follower node b. Both nodes then encode their secret key using codeword d₁, whenever e=1, and codeword d₀ whenever e=0, in one embodiment. Note that the codewords can be one or more bits in length. Specifically, the secret key is presented in Eqn. 24, where k(i) is given in Eqn 22.

Z=[d _(e(k(1)))(k(1)), . . . , d _(e(k(N)))(k(n))]  (24)

The above MAQ scheme provides a new method for a multi-bit adaptive quantization for each component of vector y. The benefits are that no components are ‘censored’ based on their value. Instead, one leader node decides upon the quantization scheme from two options which is least likely to cause disagreement between the two nodes. When disagreements occur, due to the use of Gray coding, it is very likely that only one bit of the multi-bit codeword will be in error.

Further, the passing of the vector e does not provide an eavesdropper with any information about the secret key bits. Knowing e(k(i)) eliminates half of the possible quantization levels, but codewords are equally likely given the knowledge of e(k(i)). For example, for the m_(i)=1 case, if e=1, then the eavesdropper knows that y_(a)(i) is neither very high in magnitude nor very low in magnitude. However, there are four possible equally-likely bins with e=1, two of which would be encoded with d₁=1 and two with d₀=0. The eavesdropper has no information to which bit the component will be encoded.

Analysis of Probability of Bit Disagreement

The performance of a particular MAQ scheme is measured by its probability of bit disagreement P(BD), that is, the probability that nodes a and b encode a bit differently. The term ‘disagreement’ is used rather than ‘error’ because there is no notion of the ‘correct’ bit to which a and b should have encoded when they disagree. This terminology distinguishes bit extraction from digital communications systems for which the correct bit is always known at one node.

Bit disagreement probabilities are analyzed as a function of the number of quantization bits m_(i) and the joint distribution of y_(a)(i) and y_(b)(i). This joint probability distribution function (pdf) is referred to as ƒ_(Y) _(a) _((i),Y) _(b) _((i))(y_(a), y_(b)). As discussed before, the marginal distributions of the two are identical, so the marginal p.d.f. is referred to as ƒ_(i)(y) and the cumulative distribution function (CDF) as F_(i)(y). The conditional CDF of y_(b)(i) given y_(a)(i) as written as F_(Y) _(b) _((i)|Y) _(a) _((i))(y_(b)|y_(a)). The probability of codeword disagreement is first addressed, and then an approximation for the probability of bit disagreement is provided. The two are the same in the m_(i)=1 case, but different in general.

For certain combinations of (y_(a)(i), y_(b)(i)), the codeword at node a will be encoded differently than at node b, and these combinations can be viewed graphically on a two-dimensional (2-D) plot. FIG. 7 is a diagram showing areas where generated bits at a and b will agree (gray area) and disagree (white area) for a 1 bit quantization scheme. Recall that node a is the leader node, and so y_(a) decides the quantization scheme. Given y_(a)(i), the value of y_(b)(i) thus decides whether or not a bit disagreement occurs. For example, for the 1-bit adaptive quantization scheme displayed in Table 1, the combinations of (y_(a)(i), y_(b)(i)) which result in bit agreement are shown in FIG. 7 as the gray shaded area. The plot in FIG. 7 shows the quantile of the data F′_(i) ⁻¹(•) on each axis, rather than the data y_(i) itself, in order to emphasize that the axis is being divided into eight equally likely bins. There is a wide diagonal area, where y_(a)(i) is close to or equal to y_(b)(i), which would result in codeword agreement.

If the shaded area (the bit disagreement area) is referred to as A, then the probability of codeword agreement, denoted P_(CA) is provided in Eqn. 25.

P _(CA)=∫∫_(A)ƒ_(Y) _(a) _((i),Y) _(b) _((i))(y _(a) ,y _(b))dy _(a) dy _(b)  (25)

In another form, Eqn. 25 can be rewritten in Eqn. 26.

P _(CA)=∫_(ya) P[CA|y _(a)]ƒ_(i)(y _(a))dy _(a)  (26)

In Eqn 26, P[CA|y_(a)] is the probability of code agreement given y_(a), and A(y_(a)) is the set of values of y_(b) such that (y_(a), y_(b))εA, as expressed in Eqn. 27.

P[CA|y _(a)]=∫_(ybεA(ya))ƒ_(Y) _(b) _((i)|Y) _(a) _((i))(y _(b) |y _(a))dy _(b)  (27)

MAO Performance in Gaussian Case

For the case that y_(a)(i) and y_(b)(i) are jointly Gaussian and zero mean, there is a more direct expression for the probability of code agreement. Note that that the marginal variances of y_(a)(i) and y_(b)(i) are identical, which is denoted as σ_(i) ². Letting the correlation coefficient of y_(a)(i) and y_(b)(i) be ρ_(i) leads to Eqn. 28.

$\begin{matrix} {{f_{{Y_{b}{(i)}}|{Y_{a}{(i)}}}\left( y_{b} \middle| y_{a} \right)} = {\frac{1}{\sqrt{2{{\pi\sigma}_{i}^{2}\left( {1 - \rho_{i}^{2}} \right)}}}{\exp \left\lbrack {- \frac{\left( {y_{b} - {\rho_{i}y_{a}}} \right)^{2}}{2{\sigma_{i}^{2}\left( {1 - \rho^{2}} \right)}}} \right\rbrack}}} & (28) \end{matrix}$

In short, the conditional pdf of y_(b)|y_(a) has mean ρ_(i)y_(a), and variance of σ_(i) ²(1−ρ_(i) ²). As such, P[CA|y_(a)] for the 1-bit adaptive quantization case can be written in Eqn. 29.

$\begin{matrix} {{P\left\lbrack {CA} \middle| y_{a} \right\rbrack} \geq {{\Phi \frac{{F^{- 1}\left( \alpha_{y_{a}} \right)} - {\rho_{i}y_{a}}}{\sigma_{i}\sqrt{1 - \rho_{i}^{2}}}} - {\Phi \frac{{F^{- 1}\left( \beta_{y_{a}} \right)} - {\rho_{i}y_{a}}}{\sigma_{i}\sqrt{1 - \rho_{i}^{2}}}}}} & (29) \end{matrix}$

In Eqn. 29, Φ(x) is the unit variance Gaussian CDF, and α_(ya) and β_(ya) are the high and low limits for a given y_(a) of the segment of y_(b), which results in bit agreement. From the 1-bit adaptive quantization case, it can be seen from FIG. 7 that α_(ya) and β_(ya) have the following ranges in Eqns. 30 and 31.

$\begin{matrix} {\alpha_{y_{a}} = \left\{ \begin{matrix} {0.25,} & {{F_{i}\left( y_{a} \right)} \leq 0.125} \\ {0.5,} & {0.125 < {F_{i}\left( y_{a} \right)} \leq 0.375} \\ {0.75,} & {0.375 < {F_{i}\left( y_{a} \right)} \leq 0.625} \\ {1,} & {0.625 < {F_{i}\left( y_{a} \right)}} \end{matrix} \right.} & (30) \\ {\beta_{y_{a}} = \left\{ \begin{matrix} {0,} & {{F_{i}\left( y_{a} \right)} < 0.375} \\ {0.25,} & {0.375 \leq {F_{i}\left( y_{a} \right)} < 0.625} \\ {0.5,} & {0.625 \leq {F_{i}\left( y_{a} \right)} < 0.875} \\ {0.75,} & {0.875 \leq {F_{i}\left( y_{a} \right)}} \end{matrix} \right.} & (31) \end{matrix}$

In general, for the m_(i)-bit quantization scheme, α_(ya) and β_(ya) are expressed in Eqn. 32.

α_(ya)=min{1,┌F _(i)(y _(a))+2^(−(m) ^(i) ⁺²⁾┐₂ _(−(m) _(i) ₊₁₎ }

β_(ya)=max{0,└F _(i)(y _(a))−2^(−(m) ^(i) ⁺²⁾┐₂ _(−(m) _(i) ₊₁₎ }  (32)

In Eqn. 32, the u-multiple floor and ceiling functions are defined which return the highest multiple of u lower than its argument, and the lowest multiple of u higher than its argument, respectively, as follows in Eqn 33.

$\begin{matrix} {{\left\lfloor x \right\rfloor_{u} = {u\left\lfloor \frac{x}{u} \right\rfloor}},{\left\lceil x \right\rceil_{u} = {u\left\lceil \frac{x}{u} \right\rceil}}} & (33) \end{matrix}$

Equation 29 is less than or equal to the exact P[agreement] because the main diagonal area of agreement is only considered. For example, the top-left area and bottom-right area are not considered in FIG. 7. These non-diagonal elements will typically have a very small probability, because they correspond to observing nearly opposite values on the two directional measurements. Since the two measurements have high positive correlation, it is highly unlikely to observe nearly opposite values.

Using Eqns. 26 and 29, a lower bound can be solved on the probability of agreement. For the Gaussian case, F′_(i) ⁻¹(x)=σ_(i)Φ⁻¹(x) where Φ⁻¹(x) is the inverse of the zero-mean unit variance CDF. A substitution of w=y_(a)/σ_(i) results in Eqn. 34.

$\begin{matrix} {P_{CA} \geq {\int_{w = \infty}^{\infty}{\begin{Bmatrix} {{\Phi \left\lbrack \frac{{\Phi^{- 1}\left\lbrack {\alpha \left( {\sigma_{i}w} \right)} \right\rbrack} - {\rho_{i}w}}{\sqrt{1 - \rho_{i}^{2}}} \right\rbrack} -} \\ {\Phi \left\lbrack \frac{{\Phi^{- 1}\left\lbrack {\beta \left( {\sigma_{i}w} \right)} \right\rbrack} - {\rho_{i}w}}{\sqrt{1 - \rho_{i}^{2}}} \right\rbrack} \end{Bmatrix}\ \frac{^{{- w^{2}}/2}}{\sqrt{2\pi}}{w}}}} & (34) \end{matrix}$

Note that Eqn. 34 is not a function of σ_(i), the variance of the ith component of y. Instead, it is solely a function of φ_(i) and m_(i). Note that the probability of code disagreement P_(CD)=1−P_(CA), from the lower bound in Eqn. 34, which leads to an upper bound on P_(CD). In Gray coded symbol constellations, for low P_(CD), the probability of bit disagreement, P_(BD), is approximated in Eqn. 35.

P _(BD) ≈P _(CD) /m _(i).  (35)

FIG. 8 provides the results for P_(BD), when the expression in Eqn. 34 is solved numerically, in accordance with one embodiment of the present invention. In particular, FIG. 9 provides the analytical approximation for the probability of bit disagreement from Eqn. 35, as a function of the number of bits per codeword, m, and correlation coefficient, p.

Censoring Scheme Performance in Gaussian Case

The multi-bit adaptive quantization scheme offers the possibility of encoding a component with more than one bit, which is not possible in the existing censoring scheme. However, for the m_(i)=1 case, the two bit extraction schemes are examined below.

First, the probability of bit disagreement is formulated in the censoring scheme. The bit is censored whenever either a or b measures a value between −γ and γ. Agreement occurs whenever both y_(a)(i)<−γ and y_(b)(i)<−γ, or whenever both y_(a)(i)>γ and y_(b)(i)>γ. These cases are shown in FIG. 9, which is analogous to FIG. 7 for the 1-bit MAQ scheme. FIG. 9 is a diagram showing the area of (y_(a), y_(b)) where generated bits at a and b will agree (gray area), disagree (white area), and will be censored (crosshatched area) for the censoring scheme, in accordance with one embodiment of the present invention.

Assuming a joint Gaussian distribution for (y_(a), y_(b)), the probability of censoring and the probability of bit error in Eqn 36.

$\begin{matrix} {{{P\lbrack{Censoring}\rbrack} = {\int_{w}{{P\left\lbrack {Censoring} \middle| w \right\rbrack}\frac{^{{- w^{2}}/2}}{\sqrt{2\pi}}\ {w}}}}{{P\left\lbrack {Censoring} \middle| w \right\rbrack} = \left\{ \begin{matrix} {1,} & {{- \frac{\gamma}{\sigma_{i}}} \leq w < \frac{\gamma}{\sigma_{i}}} \\ \begin{matrix} {{\Phi \left\lbrack \frac{{\gamma/\sigma_{i}} - {\rho_{i}w}}{\sqrt{1 - \rho_{i}^{2}}} \right\rbrack} -} \\ {{\Phi \left\lbrack \frac{{{- \gamma}/\sigma_{i}} - {\rho_{i}w}}{\sqrt{1 - \rho_{i}^{2}}} \right\rbrack},} \end{matrix} & {o.w.} \end{matrix} \right.}} & (36) \end{matrix}$

The expression in Eqn 36 is only a function of γ/σ_(i) and ρ, and is plotted in FIG. 10, which describes the analytical probability of a bit being censored in the censoring scheme vs. ρ and censoring threshold γ. Similarly, the probability of bit disagreement for the censoring scheme (given that it is not censored) is given by Eqn 37.

$\begin{matrix} {{P_{BD} = {\frac{1}{1 - {P\lbrack{Censoring}\rbrack}}{\int_{w}{{P\left\lbrack {BD} \middle| w \right\rbrack}\frac{^{{- w^{2}}/2}}{\sqrt{2\pi}}\ {w}}}}}{{P\left\lbrack {BD} \middle| w \right\rbrack} = \left\{ \begin{matrix} {{1 - {\Phi \left\lbrack \frac{{\gamma/\sigma_{i}} - {\rho_{i}w}}{\sqrt{1 - \rho_{i}^{2}}} \right\rbrack}},} & {w < \frac{- \gamma}{\sigma_{i}}} \\ {{\Phi \left\lbrack \frac{{{- \gamma}/\sigma_{i}} - {\rho_{i}w}}{\sqrt{1 - \rho_{i}^{2}}} \right\rbrack},} & {w > \frac{\gamma}{\sigma_{i}}} \\ {0,} & {o.w.} \end{matrix} \right.}} & (37) \end{matrix}$

The performance of the censoring scheme should be judged on the probability of bit disagreement given that the bit is used in the secret (is not censored). This is why the conditional probability of bit disagreement is divided by the factor of (1−P[Censoring]). The result is plotted in FIG. 11, which provides the analytical probability of bit disagreement from Eqn. 37. vs. ρ and censoring threshold γ, given that the bit is not censored.

The results in FIG. 11 can be compared to the m=1 line in FIG. 8. For low thresholds γ, the censoring scheme results in a higher probability of bit disagreement than the 1-bit MAQ scheme. At high γ (e.g., the γ/σ=0.2 case) censoring can provide a lower bit disagreement probability than 1-bit MAQ. However, at high γ, many bits are censored. For example, for γ/σ=0.2 and ρ=0.96, the censoring scheme achieves conditional probability of bit disagreement of 0.01 compared to 0.03 for the 1-bit MAQ scheme, but the censoring scheme must censor 24.7% of components.

For a moment, ignoring the loss of bits caused by the censoring scheme, it is considered when to use the censoring scheme instead of the MAQ scheme. When the correlation coefficient ρ is low, the threshold can be set high, and the conditional probability of bit disagreement can be made lower in the censoring scheme. For example, a design for highest possible secret bit rate with P_(BD)=0.04, m=1 would be chosen for ρ<0.98, m=2 for 0.98<ρ<0.993, and m=3 for 0.993<ρ<0.998. For the m=1 case, the censoring scheme could be used in order to lower the probability of bit disagreement at the expense of higher probability of censoring. In this example, if we have components i with ρ_(i)>0.98, the MAQ scheme offers more bits per measurement component.

A method and system for generating a digital secret between two devices is thus described. While the invention has been illustrated and described by means of specific embodiments, it is to be understood that numerous changes and modifications may be made therein without departing from the spirit and scope of the invention as defined in the appended claims and equivalents thereof. Furthermore, while the present invention has been described in particular embodiments, it should be appreciated that the present invention should not be construed as limited by such embodiments, but rather construed according to the below claims. 

1. A method for secret key exchange, comprising: exchanging transmissions between a first device and a second device over at least one channel; receiving a first signal at said first device from said second device while exchanging said transmissions and during execution of a random movement on said first device; determining a first impulse response of said first signal transmitted over said at least one channel; generating a vector based on said first impulse response, wherein said vector comprises a plurality of elements; decorrelating said plurality of elements of said vector to obtain a decorrelated vector; normalizing said decorrelated vector; and quantizing said decorrelated vector using a plurality of Gray code sequences to generate a first digital secret.
 2. The method of claim 1, wherein said quantizing said decorrelated vector comprises: grouping said decorrelated vector into a plurality of bins; assigning a corresponding code sequence to each of said plurality of bins, said corresponding code sequence comprising a first part and a second part, wherein said second part is comprised of a first Gray code sequence and a second Gray code sequence; for each element of said decorrelated vector, selecting one of said first Gray code sequence and said second Gray code sequence based on said first part; and generating a digital secret by combining selections of said first Gray code sequence and said second Gray code sequence for said plurality of elements.
 3. The method of claim 2, wherein said selecting one of said first Gray code sequence further comprises: for each element of said decorrelated vector at said first device, sending said first part to said second device; and at said second device selecting one of said first Gray code sequence and said second Gray code sequence based on said first part determined at said first device.
 4. The method of claim 1, wherein said decorrelating said plurality of indices comprises: performing a transform of said vector.
 5. The method of claim 3, further comprising: performing a Karhunen-Loève transformation on said vector.
 6. The method of claim 1, wherein said first part comprises the least significant bit, and said second part comprises the most significant bits in a corresponding Gray code sequence.
 7. The method of claim 1, wherein in a corresponding Gray code sequence, said first bit sequence comprises a single bit.
 8. The method of claim 1, wherein in a corresponding Gray code sequence, said second bit sequence comprises a single bit.
 9. The method of claim 1, wherein in a corresponding Gray code sequence, said first bit sequence comprises multiple bits.
 10. The method of claim 1, wherein in a corresponding Gray code sequence, said second bit sequence comprises multiple bits.
 11. A system for secret key exchange, comprising: a receiver for receiving a first signal at a first device from a second device while exchanging transmissions between said first device and said second device over a least one channel, said first signal being received during execution of a random movement on said first device; an impulse response generator for determining a first impulse response of said first signal transmitted over said at least one channel; a vector generator for generating a vector based on said first impulse response, wherein said vector comprises a plurality of elements; a decorrelator for decorrelating said plurality of elements of said vector to obtain a decorrelated vector; a normalizer for normalizing said decorrelated vector; and a secret key generator for quantizing said decorrelated vector using a plurality of Gray code sequences to generate a first digital secret. 